An Algorithm for a Fast Hadamard Matrix Transform of Order Twelve
نویسنده
چکیده
A recently proposed matrix factorization for aHadamard matrix of order twelve is shown to be invalid in that thefactored matrix is not Hadamard.
منابع مشابه
Fast Decoding of the p-Ary First-Order Reed-Muller Codes Based On Jacket Transform
order Reed-Muller code guaranteeing correction of up to •un/4 sin(p-1/2 pƒÎ)•v errors and having complexity proportional to nlogn, where n=pm is the code length and p is an odd prime. This algorithm is an extension in the complex domain of the fast Hadamard transform decoding algorithm applicable to the binary case. key words: p-ary first-order Reed-Muller codes, decoding algorithms, Jacket matrix
متن کاملRobust Sparse Walsh-Hadamard Transform: The SPRIGHT Algorithm
We consider the problem of stably computing the K-sparse N -point Walsh-Hadamard Transform (WHT) of a noisy input vector of length N , where K = O(N δ) scales sub-linearly in the signal dimension N for some δ ∈ (0, 1). The most efficient way known by far for computing the WHT of an arbitraryN -length signal is the Fast Walsh-Hadamard Transform (FWHT), which usesN samples and O(N logN) operation...
متن کاملDesign of Logic Network for Generating Sequency Ordered Hadamard Matrix H
A logic network to produce the sequency ordered Hadamard matrix H based on the property of gray code and orthogonal group codes is developed. The network uses a counter to generate Rademacher function such that the output of H will be in sequency. A general purpose shift register with output logic is used to establish a sequence of period P corresponding to a given value of order m of the Hadam...
متن کاملNatural-ordered complex Hadamard transform
This paper presents a new transform known as natural-ordered complex Hadamard transform (NCHT) which is derived from the Walsh–Hadamard transform (WHT) through the direct block matrix operation. Some of its properties, including the exponential property of the NCHT and the shift invariant property of the NCHT power spectrum, are presented. The relationship of the NCHT with the sequency-ordered ...
متن کاملA Noise-Adaptive Algorithm for First-Order Reed-Muller Decoding
We consider the problem of decoding First-Order Reed-Muller codes efficiently. We give an algorithm that implicitly adapts to the noise conditions, runs significantly faster than known maximum-likelihood algorithms, and yields an error rate that is very close to optimal. When applied to CCK demodulation (used in the 802.11b standard for Wireless Local Area Networks), the algorithm runs up to 4 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 20 شماره
صفحات -
تاریخ انتشار 1969